Hamiltonian cycles in random regular graphs
نویسندگان
چکیده
منابع مشابه
Rainbow Hamilton cycles in random regular graphs
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n→∞, for fixed d ≥ 8.
متن کاملShort Cycles in Random Regular Graphs
Consider random regular graphs of order n and degree d = d(n) ≥ 3. Let g = g(n) ≥ 3 satisfy (d− 1)2g−1 = o(n). Then the number of cycles of lengths up to g have a distribution similar to that of independent Poisson variables. In particular, we find the asymptotic probability that there are no cycles with sizes in a given set, including the probability that the girth is greater than g. A corresp...
متن کاملRandom Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs
Select four perfect matchings of 2n vertices, independently at random. We find the asymptotic probability that each of the first and second matchings forms a Hamilton cycle with each of the third and fourth. This is generalised to embrace any fixed number of perfect matchings, where a prescribed set of pairs of matchings must each produce Hamilton cycles (with suitable restrictions on the presc...
متن کاملHamiltonian decompositions of random bipartite regular graphs
We prove a complete hamiltonian decomposition theorem for random bipartite regular graphs, thereby verifying a conjecture of Robinson and Wormald. The main step is to prove contiguity (a kind of asymptotic equivalence) of two probabilistic models of 4-regular bipartite graphs; namely, the uniform model, and the model obtained by taking the union of two independent, uniformly chosen bipartite Ha...
متن کاملHamiltonian cycles in regular graphs of moderate degree
In this paper we prove that if k is an integer no less than 3, and if G is a two-connected graph with 2n a vertices, a E {0, 1}, which is regular of degree n k, then G is Hamiltonian if a = 0 and n > k2 + k + 1 or if a = I and n > 2k 2 3k =, 3 . We use the notation and terminology of [1] . Gordon [4] has proved that there are only a small number of exceptional graphs with 2n vertices which are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1984
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90066-2